Efficient dynamic scheduling through tag elimination

Energy efficient software through dynamic voltage scheduling

The energy usage of computer systems is becoming important, especially for portable battery-operated applications and embedded systems. A significant reduction in the energy consumption of a program can be achieved via code optimizations that transform the code to take advantage of the Instruction Set Architecture (ISA) of the target processor. These code optimizations result in significantly s...

Tag Elimination and Jones-Optimality

Tag elimination is a program transformation for removing unnecessary tagging and untagging operations from automatically generated programs. Tag elimination was recently proposed as having immediate applications in implementations of domain specific languages (where it can give a two-fold speedup), and may provide a solution to the long standing problem of Jones-optimal specialization in the ty...

Efficient Planning Through Separate Resource Scheduling

Planning consists of selecting a course of actions to achieve the desired goals, and assigning enough resources to ensure successful execution of the chosen actions. Most planners do not distinguish these phases, and do both action selection and resource assignment using the same algorithm. We will show that this strategy severely curtails the scale-up potential of existing planners, including ...

Toward Dynamic Scheduling through Evolutionary Computing

Real world scheduling requirements are related with complex systems operating in dynamic environments. This means that they are frequently subject to several kinds of random occurrences and perturbations, such as new job arrivals, machine breakdowns, employee’s sickness and jobs cancellation causing prepared schedules becoming easily outdated and unsuitable. Scheduling under this environment is...

Tag Elimination and Jones - Optimality ( Preliminary Report )